Finding Shorter Addition/Subtraction-Chains
نویسندگان
چکیده
Small Finding a shorter addition/subtraction-chain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplication on an elliptic curve cryptosystem is directly proportional to the length of the addition/subtraction-chain. In this paper, we propose an algorithm to find an addition/subtractionchain. The proposed algorithm is based on the small-window method, and reduces the number of windows by using subtractions. We show the proposed algorithm finds the shorter addition/subtraction-chain than what can be found by any other previous algorithm. Keywords— public-key, elliptic curve cryptosystem, addition/subtraction-chain
منابع مشابه
Expansion of Sliding Window Method for Finding Shorter Addition/Subtraction-Chains
Finding a shorter addition/subtraction-chain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplication on an elliptic curve cryptosystem is directly proportional to the length of the addition/subtraction-chain. In this paper, we propose an algorithm to find an addition/subtraction-chain. The proposed algorithm is b...
متن کاملA generalization of the Lucas addition chains
In this paper, a generalization of Lucas addition chains, where subtraction is allowed, is given. It is called ”Lucas addition-subtraction chain” (LASC). LASC gives minimal addition-subtraction chains for infinitely many integers and will also be used to prove the optimality of Lucas addition chains for many cases. One of the main result in the theory of addition-subtraction chains is due to Vo...
متن کاملEfficient computation of addition-subtraction chains using generalized continued Fractions
The aim of this paper is to present a new way of computing short addition-subtraction chains using the generalized continued fractions where subtraction is allowed. We will recover the most used ways of getting addition-subtraction chains. This method is not always optimal but gives minimal chains that are easy to compute.
متن کاملOn Insecurity of the Side Channel Attack Countermeasure Using Addition-Subtraction Chains under Distinguishability between Addition and Doubling
We show that a randomized addition-subtraction chains countermeasure against side channel attacks is vulnerable to SPA attack, a kind of side channel attack, under distinguishability between addition and doubling. A side channel attack is an attack that takes advantage of information leaked during execution of a cryptographic procedure. The randomized addition-subtraction chains countermeasure ...
متن کاملUnderstanding economical outcomes with the mental number line
With this study we provide evidence that the cognitive processes involved in addition/subtraction, mapped along the mental number line, seem to mediate our understanding of trading verbs. When left-to-right culture participants read "loss" verbs, cognitive activation moves "leftward" as in arithmetical subtraction, while reading "gain" verbs activates a mental rightward space as in addition. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005